Hybrid Methodology of Nonlinear Goal Programming
نویسندگان
چکیده
منابع مشابه
A Heuristic Algorithm for Nonlinear Lexicography Goal Programming with an Efficient Initial Solution
In this paper, a heuristic algorithm is proposed in order to solve a nonlinear lexicography goal programming (NLGP) by using an efficient initial point. Some numerical experiments showed that the search quality by the proposed heuristic in a multiple objectives problem depends on the initial point features, so in the proposed approach the initial point is retrieved by Data Envelopment Analysis...
متن کاملNonlinear System Modeling by Hybrid Genetic Programming
Genetic Programming (GP) is a useful tool of nonlinear model building, however a simple use of GP often fails in numeric optimization since GP hangs on random number sampling in searching appropriate constant parameters in individual representing each model candidate. From this viewpoint a hybrid GP based nonlinear system identification method is proposed in this paper. We introduce a simple nu...
متن کاملA goal programming approach for fuzzy flexible linear programming problems
We are concerned with solving Fuzzy Flexible Linear Programming (FFLP) problems. Even though, this model is very practical and is useful for many applications, but there are only a few methods for its situation. In most approaches proposed in the literature, the solution process needs at least, two phases where each phase needs to solve a linear programming problem. Here, we propose a method t...
متن کاملLogistic Planning with Nonlinear Goal Programming Models in Spreadsheets
This is a case study of a coal mining company to demonstrate how algebra principles and nonlinear goal programming can be applied for logistics planning using spreadsheet software. The paper asserts that mathematical programming techniques are not well-accepted by managers because the models are difficult to understand due to abstract notational conventions yet alternative commercial software i...
متن کاملGoal programming using multiple objective hybrid metaheuristic algorithm
In this paper, a Goal Programming (GP) model is converted into a multi-objective optimization problem (MOO) of minimizing deviations from fixed goals. To solve the resulting MOO problem, a hybrid metaheuristic with two steps is proposed to find the Pareto set’s solutions. First, a Record-to-Record Travel with an adaptive memory is used to find first non-dominated Pareto frontier solutions preem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JITA - Journal of Information Technology and Applications (Banja Luka) - APEIRON
سال: 2014
ISSN: 2233-0194,2232-9625
DOI: 10.7251/jit1402068r